Trees whose even-degree vertices induce a path are antimagic
نویسندگان
چکیده
منابع مشابه
Regular Graphs of Odd Degree Are Antimagic
An antimagic labeling of a graph G with m edges is a bijection from E(G) to {1, 2, . . . ,m} such that for all vertices u and v, the sum of labels on edges incident to u differs from that for edges incident to v. Hartsfield and Ringel conjectured that every connected graph other than the single edge K2 has an antimagic labeling. We prove this conjecture for regular graphs of odd degree.
متن کاملTrees having an even or quasi even degree sequence are graceful
A rooted tree with diameter D is said to have an even degree sequence if every vertex has even degree except for one root and the leaves, which are in the last level D/2 . The degree sequence is said to be quasi even if every vertex has even degree except for one root, every vertex in level D/2 − 1 and the leaves, which are in the last level D/2 . Hrnčiar and Haviar [P. Hrnčiar, A. Haviar, All ...
متن کاملVertices of Degree k in Random Unlabeled Trees
Let Hn be the class of unlabeled trees with n vertices, and denote by Hn a tree that is drawn uniformly at random from this set. The asymptotic behavior of the random variable degk(Hn) that counts vertices of degree k in Hn was studied, among others, by Drmota and Gittenberger in [3], who showed that this quantity satisfies a central limit theorem. This result provides a very precise characteri...
متن کاملDepth of vertices with high degree in random recursive trees
Let Tn be a random recursive tree with n nodes. List vertices of Tn in decreasing order of degree as v1, . . . , vn, and write di and hi for the degree of vi and the distance of vi from the root, respectively. We prove that, as n→∞ along suitable subsequences, ( d − blog2 nc, hi − μ lnn √ σ2 lnn ) → ((Pi, i ≥ 1), (Ni, i ≥ 1)) , where μ = 1 − (log2 e)/2, σ2 = 1 − (log2 e)/4, (Pi, i ≥ 1) is a Poi...
متن کاملAll Connected Graphs with Maximum Degree at Most 3 whose Energies are Equal to the Number of Vertices
The energy E(G) of a graph G is defined as the sum of the absolute values of its eigenvalues. Let S2 be the star of order 2 (or K2) and Q be the graph obtained from S2 by attaching two pendent edges to each of the end vertices of S2. Majstorović et al. conjectured that S2, Q and the complete bipartite graphs K2,2 and K3,3 are the only 4 connected graphs with maximum degree ∆ ≤ 3 whose energies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2020
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2322